Realization of digraphs in Abelian groups and its consequences

نویسندگان

چکیده

Let $\overrightarrow{G}$ be a directed graph with no component of orderless than~$3$, and let $\Gamma$ finite Abelian group such that $|\Gamma|\geq 4|V(\overrightarrow{G})|$ or if $|V(\overrightarrow{G})|$ is large enough respect to an arbitrarily fixed $\varepsilon>0$ then (1+\varepsilon)|V(\overrightarrow{G})|$. We show there exists injective mapping $\varphi$ from $V(\overrightarrow{G})$ the $\sum_{x\in V(C)}\varphi(x) = 0$ for every connected $C$ $\overrightarrow{G}$, where $0$ identity element $\Gamma$. Moreover we some applications this result distance magic labelings.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automorphism groups and isomorphisms of Cayley digraphs of Abelian groups

Let S be a minimal generating subset of the finite abelian group G. We prove that if the Sylow 2-subgroup of G is cyclic, then Sand S U S-l are CI-subsets and the corresponding Cayley digraph and graph are normal. Let G be a finite group and let S be a subset of G not containing the identity element 1. The Cayley digraph X = Cay(G, S) of G with respect to S is defined by V(X) = G, E(X) = {(g,sg...

متن کامل

Cayley Digraphs of Finite Abelian Groups and Monomial Ideals

In the study of double-loop computer networks, the diagrams known as L-shapes arise as a graphical representation of an optimal routing for every graph’s node. The description of these diagrams provides an efficient method for computing the diameter and the average minimum distance of the corresponding graphs. We extend these diagrams to multiloop computer networks. For each Cayley digraph with...

متن کامل

A note on isomorphisms of Cayley digraphs of Abelian groups

Let Sand T be two minimal generating s~bsets of a finite abelian group G. We prove that if Cay(G, S) ~ Cay(G, T) then there exists an a E Aut(G) such that SOl = T. Let G be a finite group and S a subset of G not containing the identity element 1. The Cayley digraph X = Cay( G, S) of G with respect to S is defined by V(X) = G, E(X) = {(g,sg) I 9 E G,s E S}. It is easy to check that if a is an au...

متن کامل

Realization of finite abelian groups by nets in P²

In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result is the restriction on k it can be only 3,4, or 5. The most interesting class of nets is formed by 3-nets that relate to finite geometries, latin squares, loop...

متن کامل

Asymptotic automorphism groups of Cayley digraphs and graphs of abelian groups of prime-power order

We show that almost every Cayley graph Γ of an abelian group G of odd prime-power order has automorphism group as small as possible. Additionally, we show that almost every Cayley (di)graph Γ of an abelian group G of odd prime-power order that does not have automorphism group as small as possible is a normal Cayley (di)graph of G (that is, GL/Aut(Γ)).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Theory

سال: 2021

ISSN: ['0364-9024', '1097-0118']

DOI: https://doi.org/10.1002/jgt.22782